A generalised combinatorial distribution problem
نویسندگان
چکیده
منابع مشابه
A generalised isodiametric problem
Fix positive integers a and b such that a > b ≥ 2 and a positive real δ > 0. Let S be a planar set of diameter δ having the following property: for every a points in S, at least b of them have pairwise distances that are all less than or equal to 2. What is the maximum Lebesgue measure of S? In this paper we investigate this problem. We discuss the, devious, motivation that leads to its formula...
متن کاملOn a Combinatorial Problem
Let M be a set and F a family of its subsets. F is said by E. W. MILLER [5] to possess property B if there exists a subset K of M so that no set of the family F is contained either in K or in K (K is the complement of K in M) . HAJNAL and 1 [2] recently published a paper on the property B and its generalisations . One of the unsolved problems we state asks : What is the smallest integer in (n) ...
متن کاملA Generalised Network Flow Approach to Combinatorial Auctions
In this paper we address the problem of (1) representing bids for combinatorial auctions and (2) employing those structures for “reasoning”. We propose a graph-based language who’s novelty lies (1) in the use of generalized network flows to represent the bids and (2) in the interpretation of winner determination as an adequate aggregation of individual preferences. We motivate the language both...
متن کاملThe Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem
This paper presents the formulation and solution of the Combinatorial Multi-Mode Resource Constrained Multi-Project Scheduling Problem. The focus of the proposed method is not on finding a single optimal solution, instead on presenting multiple feasible solutions, with cost and duration information to the project manager. The motivation for developing such an approach is due in part to practica...
متن کاملThe Generalised Coupon Collector Problem
Coupons are collected one at a time from a population containing n distinct types of coupon. The process is repeated until all n coupons have been collected and the total number of draws, Y , from the population is recorded. It is assumed that the draws from the population are independent and identically distributed (draws with replacement) according to a probability distributionXwith the proba...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of the Mathematical Society of Japan
سال: 1973
ISSN: 0025-5645
DOI: 10.2969/jmsj/02520317